Coalgebraic trace semantics via forgetful logics
نویسندگان
چکیده
منابع مشابه
Coalgebraic Trace Semantics via Forgetful Logics
We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative probabilistic systems. We provide a sufficient condition under which a logical semantics coincides with the trace semantics obtained via a given determin...
متن کاملContext-Free Languages via Coalgebraic Trace Semantics
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general and novel technique of finite trace semantics for coalgebras. It builds on top of the (possibly infinite) trace semantics introduced earlier by the second author, but extracts only finite behavior. Interestingly the fini...
متن کاملAlgebraic Semantics for Coalgebraic Logics
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T -coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T , we cons...
متن کاملCoalgebraic semantics of modal logics: An overview
Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense, coalgebraic logics are generalised modal logics. In this paper, we give an overview of the basic tools, techniques and results that connect coalgebras and modal logic. We argue that coalgebras unify the semantics of a large range of different modal logics (such as probabilistic, graded, relational, conditional)...
متن کاملCompleteness-via-canonicity for coalgebraic logics
This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibility to generalize what is arguably one of the most successful methods to prove completeness results in ‘classical’ modal logic, namely completeness-via-canonicity. This technique is particularly well-suited to a coalge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2017
ISSN: 1860-5974
DOI: 10.2168/lmcs-12(4:10)2016